Membrane Systems Languages Are Polynomial-Time Parsable
نویسندگان
چکیده
The focus of this paper is the family of languages generated by transitional non-cooperative P systems without further ingredients. This family can also be defined by so-called time yields of derivation trees of context-free grammars. In this paper we prove that such languages can be parsed in polynomial time, where the degree of polynomial may depend on the number of rules and on the size of the alphabet.
منابع مشابه
Generation and Parsing of Morphism Languages by Uniquely Parallel Parsable Grammars
A uniquely parsable grammar (UPG) introduced by Morita et al. (1997) is a kind of generative grammar, where parsing can be performed without backtracking. In this paper, we investigate a uniquely parallel parsable grammar (UPPG). We give a simple sufficient condition on morphism languages, and show that every such morphism language can be parsed efficiently in parallel by a UPPG. We show that t...
متن کاملAPPLICATION OF EVOLUTIONARY POLYNOMIAL REGRESSION IN ULTRAFILTRATION SYSTEMS CONSIDERING THE EFFECT OF DIFFERENT PARAMETERS ON OILY WASTEWATER TREATMENT
In the present work, the effects of operating conditions including pH, transmembrane pressure, oil concentration, and temperature on fouling resistance and the rejection of turbidity for a polymeric membrane in an ultrafiltration system of wastewater treatment were studied. A new modeling technique called evolutionary polynomial regression (EPR) was investigated. EPR is a method based on regres...
متن کاملOn Computational Complexity of Contextual Languages
We consider the following restriction of internal contextual grammars, called local: in any derivation in a grammar, after applying a context, further contexts can be added only inside of or at most adjacent to the previous ones. We further consider a natural restriction of this derivation mode by requiring that no superword of the word considered as selector can be used as selector. We investi...
متن کاملPolynomially parsable unification grammars
Unification grammars (UG) are a grammatical formalism that underlies several contemporary linguistic theories, including Lexical-functional Grammar and Head-driven Phrase-structure Grammar. UG is an especially attractive formalism because of its expressivity, which facilitates the expression of complex linguistic structures and relations. Formally, UG is Turing-complete, generating the entire c...
متن کاملOn the pLR Parsability of Visual Languages
The widespread use of visual languages has motivated the need for grammar-based tools to support designers in the definition and implementation of graphical environments. The effective use of such systems requires efficient parsing techniques. The VLCC system makes use of a suitable LR-like methodology that allows us to efficiently parse visual sentences [1]. However there exist particular gram...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 18 شماره
صفحات -
تاریخ انتشار 2010